2 2 N ov 2 00 7 Graphs with many r - cliques have large complete r - partite subgraphs
نویسنده
چکیده
Let r ≥ 2 and c > 0. Every graph on n vertices with at least cnr cliques on r vertices contains a complete r-partite subgraph with r − 1 parts of size ⌊cr log n⌋ and one part of size greater than n1−c r−1 . This result implies the Erdős-Stone-Bollobás theorem, the essential quantitative form of the Erdős-Stone theorem.
منابع مشابه
Graphs with many r-cliques have large complete r-partite subgraphs
We prove that for all r ≥ 2 and c > 0, every G graph of order n with at least cnr cliques of order r contains a complete r-partite graph with each part of size ⌊cr log n⌋ . This result implies a concise form of the Erdős-Stone theorem.
متن کاملCohen-Macaulay $r$-partite graphs with minimal clique cover
In this paper, we give some necessary conditions for an $r$-partite graph such that the edge ring of the graph is Cohen-Macaulay. It is proved that if there exists a cover of an $r$-partite Cohen-Macaulay graph by disjoint cliques of size $r$, then such a cover is unique.
متن کاملN ov 2 00 7 Turán ’ s theorem inverted
Let K+ r (s1, . . . , sr) be the complete r-partite graph with parts of size s1 ≥ 2, s2, . . . , sr with an edge added to the first part. Letting tr (n) be the number of edges of the r-partite Turán graph of order n, we prove that: (A) For all r ≥ 2 and all sufficiently small ε > 0, every graph of sufficiently large order n with tr (n) + 1 edges contains a K + r ( ⌊c lnn⌋ , . . . , ⌊c lnn⌋ , ⌈ ...
متن کاملLarge joints in graphs
We show that if r s 2; n > r8; and G is a graph of order n containing as many r-cliques as the r-partite Turán graph of order n; then G has more than nr 1=r2r+12 cliques sharing a common edge unless G is isomorphic to the r-partite Turán graph of order n. This structural result generalizes a previous result that has been useful in extremal graph theory.
متن کاملar X iv : m at h / 06 11 62 6 v 1 [ m at h . C O ] 2 1 N ov 2 00 6 COUNTING LINKS IN COMPLETE GRAPHS
We find the minimal number of links in an embedding of any complete k-partite graph on 7 vertices (including K 7 , which has at least 21 links). We give either exact values or upper and lower bounds for the minimal number of links for all complete k-partite graphs on 8 vertices. We also look at larger complete bipartite graphs, and state a conjecture relating minimal linking embeddings with min...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1985